Great Deluge Algorithm for Protein Structure Prediction

نویسندگان

  • Edmund Burke
  • Yuri Bykov
  • Jonathan Hirst
چکیده

Proteins are the basis of organic life on the Earth. These macromolecules appear as polymer chains comprising ∼70 to more than 500 residues (amino acids) of 20 different monomer types. In nature such chains fold into certain 3-dimensional structures (see example in Fig.1). The distinct property of proteins (which distinguishes them from other polymers) is that all molecules with the same order of residues fold into the same structure (so-called native state conformation). There is a general hypothesis that in the native state all interatomic forces are balanced and a molecule has the minimum possible internal energy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Genetic Algorithm for 2D Protein Folding Simulations

Protein folding problem is one of the most interesting problem in the medical field, which consists in finding the tertiary structure for a given amino acid sequence of a protein. Protein folding is NP hard problem. In this paper, we hybridized genetic algorithm with a local search algorithm to solve 2D Protein folding problem. This kind of hybridization empower the genetic algorithm exploratio...

متن کامل

Protein Secondary Structure Prediction: a Literature Review with Focus on Machine Learning Approaches

DNA sequence, containing all genetic traits is not a functional entity. Instead, it transfers to protein sequences by transcription and translation processes. This protein sequence takes on a 3D structure later, which is a functional unit and can manage biological interactions using the information encoded in DNA. Every life process one can figure is undertaken by proteins with specific functio...

متن کامل

Incorporating Great Deluge with Kempe Chain Neighbourhood Structure for the Enrolment-Based Course Timetabling Problem

In general, course timetabling refers to assignment processes that assign events (courses) to a given rooms and timeslots subject to a list of hard and soft constraints. It is a challenging task for the educational institutions. In this study we employed a great deluge algorithm with kempe chain neighbourhood structure as an improvement algorithm. The Round Robin (RR) algorithm is used to contr...

متن کامل

Great Deluge Algorithm for Rough Set Attribute Reduction

The process of reducing the number of attributes from an information system is known as attribute reduction problem. The action of attribute reduction problem is an important step of pre-processing in data mining. In the attribute reduction process, reduction is performed with considerations for minimum information loss. Having a dataset with discrete attribute values, it is possible to find a ...

متن کامل

An Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems

The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003